Optimized Pessimistic Fibonacci Back-off Algorithm (PFB)
نویسندگان
چکیده
منابع مشابه
Optimized Pessimistic Fibonacci Back-off Algorithm (PFB)
MANET is a self-directed system consisting of mobile nodes, which can be either routers and/or hosts. Nodes in MANET are connected by wireless links without base stations. The Backoff algorithm considered as a main element of Media Access Control (MAC) protocol, which is used to avoid collision in MANET’s. The Fibonacci Backoff algorithm and the Pessimistic Fibonacci Backoff are proposed to imp...
متن کاملAn Optimized Trade-off Decomposition Steganography Algorithm
In this paper a modified Steganography algorithm is proposed. A fuzzification is performed in the message channel to compress the decomposed coefficients before embedding in the cover-image to get a new Stego-image. A relative embedding strength factor (ESF) is used for embedding the secret in the cover-image. The well known metrics (MSE, PSNR, Cor. and Entropy) were used to evaluate quality of...
متن کاملHybrid Optimized Back propagation Learning Algorithm For Multi-layer Perceptron
Standard neural network based on general back propagation learning using delta method or gradient descent method has some great faults like poor optimization of error-weight objective function, low learning rate, instability .This paper introduces a hybrid supervised back propagation learning algorithm which uses trust-region method of unconstrained optimization of the error objective function ...
متن کاملThe Optimal Pessimistic Transactional Memory Algorithm
Transactional Memory (TM) is an approach aiming to simplify concurrent programming by automating synchronization while maintaining efficiency. TM usually employs the optimistic concurrency control approach, which relies on transactions aborting and restarting if conflicts occur. However, an aborted transaction can still leave some effects in the system that cannot be cleaned up, if irrevocable ...
متن کاملFast Fibonacci Encoding Algorithm
Data compression has been widely applied in many data processing areas. Compression methods use variable-length codes with the shorter codes assigned to symbols or groups of symbols that appear in the data frequently. Fibonacci code, as a representative of these codes, is often utilized for the compression of small numbers. Time consumption of encoding as well as decoding algorithms is importan...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2012
ISSN: 2158-107X,2156-5570
DOI: 10.14569/ijacsa.2012.030939